A forward algorithm for solving optimal stopping problems
نویسندگان
چکیده
منابع مشابه
A Forward Algorithm for Solving Optimal Stopping Problems
We consider the optimal stopping problem for g(Zn), where Zn, n = 1, 2, . . . , is a homogeneous Markov sequence. An algorithm, called forward improvement iteration, is presented by which an optimal stopping time can be computed. Using an iterative step, this algorithm computes a sequence B0 ⊇ B1 ⊇ B2 ⊇ · · · of subsets of the state space such that the first entrance time into the intersection ...
متن کاملA quantization algorithm for solving multi-dimensional Optimal Stopping problems
A new grid method for computing the Snell envelop of a function of a R d -valued Markov chain (Xk)0≤k≤n is proposed. (This problem is typically non linear and cannot be solved by the standard Monte Carlo method.) Every Xk is replaced by a “quantized approximation” X̂k taking its values in a grid Γk of size Nk. The n grids and their transition probability matrices make up a discrete tree on which...
متن کاملA Least Squares Q-Learning Algorithm for Optimal Stopping Problems
We consider the solution of discounted optimal stopping problems using linear function approximation methods. A Q-learning algorithm for such problems, proposed by Tsitsiklis and Van Roy, is based on the method of temporal differences and stochastic approximation. We propose alternative algorithms, which are based on projected value iteration ideas and least squares. We prove the convergence of...
متن کاملA Method for Solving Optimal Control Problems Using Genetic Programming
This paper deals with a novel method for solving optimal control problems based on genetic programming. This approach produces some trial solutions and seeks the best of them. If the solution cannot be expressed in a closed analytical form then our method produces an approximation with a controlled level of accuracy. Using numerical examples, we will demonstrate how to use the results.
متن کاملIntegrating Differential Evolution Algorithm with Modified Hybrid GA for Solving Nonlinear Optimal Control Problems
‎Here‎, ‎we give a two phases algorithm based on integrating differential evolution (DE) algorithm with modified hybrid genetic algorithm (MHGA) for solving the associated nonlinear programming problem of a nonlinear optimal control problem‎. ‎In the first phase‎, ‎DE starts with a completely random initial population where each individual‎, ‎or solution‎...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2006
ISSN: 0021-9002
DOI: 10.1239/jap/1143936246